CANONICITY IN POWER AND MODAL LOGICS OF FINITE ACHRONAL WIDTH
نویسندگان
چکیده
Abstract We develop a method for showing that various modal logics are valid in their countably generated canonical Kripke frames must also be uncountably ones. This is applied to many systems, including the of finite width, and broader class multimodal ‘finite achronal width’ introduced here.
منابع مشابه
Constant Modal Logics and Canonicity
If a modal logic is valid in its canonical frame, and its class of validating frames is invariant under bounded epimorphisms (or equivalently, closed under images of bisimulations), then the logic is axiomatizable by variable-free formulas. Hence its class of frames is first-order definable.
متن کاملXPath and Modal Logics of Finite DAG's
XPath, CTL and the modal logics proposed by Blackburn et al, Palm and Kracht are variable free formalisms to describe and reason about (finite) trees. XPath expressions evaluated at the root of a tree correspond to existential positive modal formulas. The models of XPath expressions are finite ordered trees, or in the presence of XML’s ID/IDREF mechanism graphs. The ID/IDREF mechanism can be se...
متن کاملStrong completeness and limited canonicity for PDL and similar modal logics
Propositional dynamic logic (PDL) is complete but not compact. As a consequence, strong completeness (the property Γ |= φ ⇒ Γ ` φ) requires an infinitary proof system. In this paper, we present a short proof for strong completeness of PDL relative an infinitary proof system containing the rule from [α;βn]φ for all n ∈ N, conclude [α;β∗]φ. The proof uses a universal canonical model, and it is ge...
متن کاملAlgebraic Canonicity in Non-Classical Logics
This thesis is a study of the notion of canonicity (as is understood e.g. in modal logic) from an algebraic viewpoint. The main conceptual contribution of this thesis is a better understanding of the connection between the Jónsson-style canonicity proof and the canonicity-via-correspondence. The main results of this thesis include an ALBA-aided Jónsson-style canonicity proof for inductive inequ...
متن کاملCanonicity for Intensional Logics Without Iterative Axioms
DAVID LEWIS proved in 1974 that all logics without iterative axioms are weakly complete. In this paper we extend LEWIS’s ideas and provide a proof that such logics are canonical and so strongly complete. This paper also discusses the differences between relational and neighborhood frame semantics and poses a number of open questions about the latter. Canonicity for Intensional Logics Without It...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Symbolic Logic
سال: 2023
ISSN: ['1755-0211', '1755-0203']
DOI: https://doi.org/10.1017/s1755020323000060